On Augmented Lagrangian Methods with General Lower-Level Constraints
نویسندگان
چکیده
منابع مشابه
On Augmented Lagrangian Methods with General Lower-Level Constraints
Augmented Lagrangian methods with general lower-level constraints are considered in the present research. These methods are useful when efficient algorithms exist for solving subproblems in which the constraints are only of the lower-level type. Inexact resolution of the lower-level constrained subproblems is considered. Global convergence is proved using the Constant Positive Linear Dependence...
متن کاملGlobal minimization using an Augmented Lagrangian method with variable lower-level constraints
A novel global optimization method based on an Augmented Lagrangian framework is introduced for continuous constrained nonlinear optimization problems. At each outer iteration k the method requires the εk-global minimization of the Augmented Lagrangian with simple constraints, where εk → ε. Global convergence to an ε-global minimizer of the original problem is proved. The subproblems are solved...
متن کاملPractical Augmented Lagrangian Methods
for all x ∈ IR, λ ∈ IR, μ ∈ IR +. PHR-based Augmented Lagrangian methods for solving (1) are based on the iterative (approximate) minimization of Lρ with respect to x ∈ Ω, followed by the updating of the penalty parameter ρ and the Lagrange multipliers approximations λ and μ. The most popular practical Augmented Lagrangian method gave rise to the Lancelot package [24, 25, 26]. Lancelot does not...
متن کاملAugmented Lagrangian methods with smooth penalty functions
Since the late 1990s, the interest in augmented Lagrangian methods has been revived, and several models with smooth penalty functions for programs with inequality constraints have been proposed, tested and used in a variety of applications. Global convergence results for some of these methods have been published. Here we present a local convergence analysis for a large class of smooth augmented...
متن کاملDerivative-free methods for nonlinear programming with general lower-level constraints*
Augmented Lagrangian methods for derivative-free continuous optimization with constraints are introduced in this paper. The algorithms inherit the convergence results obtained by Andreani, Birgin, Martínez and Schuverdt for the case in which analytic derivatives exist and are available. In particular, feasible limit points satisfy KKT conditions under the Constant Positive Linear Dependence (CP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2008
ISSN: 1052-6234,1095-7189
DOI: 10.1137/060654797